---
title: "L1-070 吃火锅"
created: 2025-11-28
tags:
  - 算法
---

# L1-070 吃火锅

## 题目 [L1-070 吃火锅](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1336215880692482053&page=0)

![[image-c248802f.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};

const int inf = 0x3f3f3f3f;

int main(){

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	string s;

	int cnt=0;

	bool isFirst=true;

	int thefirst=0,total=0;

	while(true){

		getline(cin,s);

		if(s==".")	break;

		cnt++;

		if(s.find("chi1 huo3 guo1")!=-1){

			total++;

			if(isFirst){

				thefirst=cnt;

				isFirst=false;

			}

		}

	}

	cout<<cnt<<endl;

	if(total==0){

		cout<<"-_-#";

	}else{

		cout<<thefirst<<" "<<total;

	}

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-069 胎压监测|L1-069 胎压监测]] 🏠 [[00-天梯赛]] ➡️ [[L1-071 前世档案|L1-071 前世档案]]